Violation Semirings in Optimality Theory
نویسنده
چکیده
This paper provides a brief algebraic characterization of constraint violations in Optimality Theory (OT). I show that if violations are taken to be multisets over a fixed basis set Con then the merge operator on multisets and a ‘min’ operation expressed in terms of harmonic inequality provide a semiring over violation profiles. This semiring allows standard optimization algorithms to be used for OT grammars with weighted finite-state constraints in which the weights are violation-multisets. Most usefully, because multisets are unordered, the merge operation is commutative and thus it is possible to give a single graph representation of the entire class of grammars (i.e. rankings) for a given constraint set. This allows a neat factorization of the optimization problem that isolates the main source of complexity into a single constant γ denoting the size of the graph representation of the whole constraint set. I show that the computational cost of optimization is linear in the length of the underlying form with the multiplicative constant γ. This perspective thus makes it straightforward to evaluate the complexity of optimization for different constraint sets.
منابع مشابه
Optimality Theory and Vector Semirings
As [5] and [11] have shown, some applications of Optimality Theory can be modelled using finite state algebra provided that the constraints are regular. However, their approaches suffered from an upper bound on the number of constraint violations. We present a method to construct finite state transducers which can handle an arbitrary number of constraint violations using a variant of the tropic...
متن کاملOptimality Of Monetary And Fiscal Policies In Iran: An Application Of The Stochastic Optimal Control Theory
متن کامل
Path Optimization and Trusted Routing in MANET: An Interplay Between Ordered Semirings
In this paper, we formulate the problem of trusted routing as a transaction of services over a complex networked environment. We present definitions from service-oriented environments that unambiguously capture the difference between trust and reputation relations. We show that the trustworthiness metrics associated with these relations have a linear order embedded in them. Identifying this ord...
متن کاملTheorie Des Lexikons Arbeiten Des Sonderforschungsbereichs 282 Ot Simple { a Construction-kit Approach to Optimality Theory Implementation Ot Simple { a Construction-kit Approach to Optimality Theory Implementation
This paper details a simple approach to the implementation of Optimality Theory (OT, Prince and Smolensky 1993) on a computer, in part reusing standard system software. In a nutshell, OT's GENerating source is implemented as a BinProlog program interpreting a context-free speci cation of a GEN structural grammar according to a user-supplied input form. The resulting set of textually attened can...
متن کاملOptimality Theory as a Family of Cumulative Logics
We investigate two formalizations of Optimality Theory, a successful paradigm in linguistics. We first give an order-theoretic counterpart for the data and process involved in candidate evaluation. Basically, we represent each constraint as a function that assigns every candidate a degree of violation. As for the second formalization, we define (after Samek-Lodovici and Prince) constraints as o...
متن کامل